Circle Extraction via Least Squares and the Kalman Filter

نویسنده

  • Mark S. Nixon
چکیده

Abstr~tct. Two new techniques have been developed to extract circles in computer images and this paper clarifies their implementation. One technique uses nonlinear least squares, the other an extended Kalman filter. Parameter estimation is based on analysing the residual gradient direction where the locus of an approximation to a circle intersects the target circle. This approach allows powerful estimation techniques to be used for feature extraction in computer vision. The least squares technique is based on adapting an earlier method developed for ellipse extraction which has been modified not only for circle estimation but also to reduce sensitivity in par~a~aeter estimation. The Kalman filter algorithm is an extended version arranged to estimate the circle's parameters. Simulation results show that both techniques can extract circles in application but the Kalman filter implementation took more iterations and a number of factors limit its use The least squares technique only is shown applied to grey level images. Both techniques serve to extract circles when an initial approximation to the circle is known and hence are most suited to tracking circles in computer images. The techniques are at present being extended to include data weighting accordfaag to edge magnitude and direction.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate Conditional Least Squares Estimation of a Nonlinear State-Space Model via Unscented Kalman Filter

We consider the problem of estimating a nonlinear state-space model whose state process is driven by an ordinary differential equation (ODE) or a stochastic differential equation (SDE), with discrete-time data. We propose a new estimation method by minimizing the conditional least squares (CLS) with the conditional mean function computed approximately via unscented Kalman filter (UKF). We deriv...

متن کامل

Decay Chain Fitting with a Kalman Filter

We present a method to perform a least squares fit of a decay chain involving multiple decay vertices. Our technique allows for the simultaneous extraction of decay time, position and momentum parameters and their uncertainties and correlations for all particles in a decay chain.

متن کامل

Rotated Unscented Kalman Filter for Two State Nonlinear Systems

In the several past years, Extended Kalman Filter (EKF) and Unscented Kalman Filter (UKF) havebecame basic algorithm for state-variables and parameters estimation of discrete nonlinear systems.The UKF has consistently outperformed for estimation. Sometimes least estimation error doesn't yieldwith UKF for the most nonlinear systems. In this paper, we use a new approach for a two variablestate no...

متن کامل

Kalman Filter Algorithm for Adaptive Digital Predistortion

This paper introduces a recursive algorithm of Kalman filter for digital predistorter parameters extraction based on memory polynomials predistorter model. The predistorter model is firstly formulated as linear regression expression. Then we derive the state-space equation of the model and attain the steps of the algorithm. Finally, the accuracy and stability of the algorithm is proved by simul...

متن کامل

Least Squares and Kalman Filtering on Forney Graphs

General versions of Kalman filtering and recursive least-squares algorithms are derived as instances of the sum(mary)-product algorithm on Forney-style factor graphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993